YES 1.774
↳ HASKELL
↳ CR
((lookupWithDefaultFM :: FiniteMap Char a -> a -> Char -> a) :: FiniteMap Char a -> a -> Char -> a) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
||||||||||||||||||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
||||||||||||||||||||||||
lookupWithDefaultFM :: Ord b => FiniteMap b a -> a -> b -> a
|
import qualified FiniteMap import qualified Prelude |
case lookupFM fm key of Nothing → deflt Just elt → elt
lookupWithDefaultFM0 deflt Nothing = deflt lookupWithDefaultFM0 deflt (Just elt) = elt
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
((lookupWithDefaultFM :: FiniteMap Char a -> a -> Char -> a) :: FiniteMap Char a -> a -> Char -> a) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
||||||||||||||||||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
||||||||||||||||||||||||
lookupWithDefaultFM :: Ord b => FiniteMap b a -> a -> b -> a
|
||||||||||||||||||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((lookupWithDefaultFM :: FiniteMap Char a -> a -> Char -> a) :: FiniteMap Char a -> a -> Char -> a) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
||||||||||||||||||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
||||||||||||||||||||||||
lookupWithDefaultFM :: Ord b => FiniteMap b a -> a -> b -> a
|
||||||||||||||||||||||||
|
import qualified FiniteMap import qualified Prelude |
lookupFM EmptyFM key = Nothing lookupFM (Branch key elt vw fm_l fm_r) key_to_find
| key_to_find < key
= lookupFM fm_l key_to_find | key_to_find > key
= lookupFM fm_r key_to_find | otherwise
= Just elt
lookupFM EmptyFM key = lookupFM4 EmptyFM key lookupFM (Branch key elt vw fm_l fm_r) key_to_find = lookupFM3 (Branch key elt vw fm_l fm_r) key_to_find
lookupFM2 key elt vw fm_l fm_r key_to_find True = lookupFM fm_l key_to_find lookupFM2 key elt vw fm_l fm_r key_to_find False = lookupFM1 key elt vw fm_l fm_r key_to_find (key_to_find > key)
lookupFM1 key elt vw fm_l fm_r key_to_find True = lookupFM fm_r key_to_find lookupFM1 key elt vw fm_l fm_r key_to_find False = lookupFM0 key elt vw fm_l fm_r key_to_find otherwise
lookupFM0 key elt vw fm_l fm_r key_to_find True = Just elt
lookupFM3 (Branch key elt vw fm_l fm_r) key_to_find = lookupFM2 key elt vw fm_l fm_r key_to_find (key_to_find < key)
lookupFM4 EmptyFM key = Nothing lookupFM4 wv ww = lookupFM3 wv ww
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(lookupWithDefaultFM :: FiniteMap Char a -> a -> Char -> a) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
lookupWithDefaultFM :: Ord a => FiniteMap a b -> b -> a -> b
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
new_lookupWithDefaultFM02(wx30, wx31, wx32, wx33, wx34, wx35, wx36, h) → new_lookupWithDefaultFM00(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx36), Succ(wx31), h)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Zero, Succ(wx380), h) → new_lookupWithDefaultFM01(wx30, wx34, Char(Succ(wx36)), h)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx370), Succ(wx380), h) → new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, wx370, wx380, h)
new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, Succ(wx910), Succ(wx920), ba) → new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, wx910, wx920, ba)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx370), Zero, h) → new_lookupWithDefaultFM00(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx36), Succ(wx31), h)
new_lookupWithDefaultFM01(wx4, Branch(Char(Succ(wx3000)), wx31, wx32, wx33, wx34), Char(Zero), bb) → new_lookupWithDefaultFM01(wx4, wx33, Char(Zero), bb)
new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, Succ(wx910), Zero, ba) → new_lookupWithDefaultFM01(wx84, wx89, Char(Succ(wx90)), ba)
new_lookupWithDefaultFM01(wx4, Branch(Char(Zero), wx31, wx32, wx33, wx34), Char(Succ(wx500)), bb) → new_lookupWithDefaultFM01(wx4, wx34, Char(Succ(wx500)), bb)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Zero, Zero, h) → new_lookupWithDefaultFM02(wx30, wx31, wx32, wx33, wx34, wx35, wx36, h)
new_lookupWithDefaultFM01(wx4, Branch(Char(Succ(wx3000)), wx31, wx32, wx33, wx34), Char(Succ(wx500)), bb) → new_lookupWithDefaultFM0(wx4, wx3000, wx31, wx32, wx33, wx34, wx500, wx500, wx3000, bb)
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
new_lookupWithDefaultFM01(wx4, Branch(Char(Succ(wx3000)), wx31, wx32, wx33, wx34), Char(Zero), bb) → new_lookupWithDefaultFM01(wx4, wx33, Char(Zero), bb)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
new_lookupWithDefaultFM02(wx30, wx31, wx32, wx33, wx34, wx35, wx36, h) → new_lookupWithDefaultFM00(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx36), Succ(wx31), h)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Zero, Succ(wx380), h) → new_lookupWithDefaultFM01(wx30, wx34, Char(Succ(wx36)), h)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx370), Succ(wx380), h) → new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, wx370, wx380, h)
new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, Succ(wx910), Succ(wx920), ba) → new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, wx910, wx920, ba)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx370), Zero, h) → new_lookupWithDefaultFM00(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Succ(wx36), Succ(wx31), h)
new_lookupWithDefaultFM00(wx84, wx85, wx86, wx87, wx88, wx89, wx90, Succ(wx910), Zero, ba) → new_lookupWithDefaultFM01(wx84, wx89, Char(Succ(wx90)), ba)
new_lookupWithDefaultFM01(wx4, Branch(Char(Zero), wx31, wx32, wx33, wx34), Char(Succ(wx500)), bb) → new_lookupWithDefaultFM01(wx4, wx34, Char(Succ(wx500)), bb)
new_lookupWithDefaultFM0(wx30, wx31, wx32, wx33, wx34, wx35, wx36, Zero, Zero, h) → new_lookupWithDefaultFM02(wx30, wx31, wx32, wx33, wx34, wx35, wx36, h)
new_lookupWithDefaultFM01(wx4, Branch(Char(Succ(wx3000)), wx31, wx32, wx33, wx34), Char(Succ(wx500)), bb) → new_lookupWithDefaultFM0(wx4, wx3000, wx31, wx32, wx33, wx34, wx500, wx500, wx3000, bb)
From the DPs we obtained the following set of size-change graphs: